Performance of Heuristic Algorithms in minimizing BER for Robust Turbo Codes

نویسنده

  • Suman Kshirsagar
چکیده

The third component introduced in conventional turbo codes in recent days is effective in improving the performance of the code. But under noisy environments the parameters such as permeability and permittivity rates are static and hence their adapatability to noisy environment is poor. To overcome the aforesaid drawback A3D-TC was proposed in our previous paper[29].In our present paper a comparison has been made between two heuristic algorithms viz.,Genetic algorithm and Simulated annealing algorithm. The parameters are made adaptive by generating a knowledge source using both Genetic algorithm and Simulating Annealing algorithm. The source output is fed to the feed forward neural network. The bit error rate at decoding section is tried to minimize in an effective way by the third component parameters generated from the neural network. Under various noisy environments, the experimental results compare the performance of A3D-TC using both Genetic algorithm and simulated annealing algorithm. Index terms A3D-TC, knowledge feeding, GA-based knowledge source, simulated annealing, adaptive, permeability rate, permittivity rate, and third component

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance of Turbo Codes Using Code Generator [13, 15] and [31, 17] in AWGN and Fading Channel

Turbo coding is a very powerful error correction technique that has made a tremendous impact on channel coding in the last few years. They are recommended for increased capacity at higher transmission rates due to their superior performance over conventional codes. Turbo codes use any one of the decoding algorithms, Maximum a posteriori Probability (log MAP), Soft Output Viterbi Algorithm (SOVA...

متن کامل

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

متن کامل

HIGH-PERFORMANCE SOVA DECODING FOR TURBO CODES OVER cdma2000 MOBILE RADIO Duanyi

An improved version of the soft-output Viterbi algorithm (SOVA), which has been theoretically proven to be equivalent to the Max-Log-maximum a posteriori (MaxLog-MAP) algorithm but with greatly reduced decoding complexity, is applied to turbo codes over the 3rd generation cdma2000 mobile radio link. The BER and FER performances ofthe improved SO VA are evaluated by computer simulation, and comp...

متن کامل

Bit Error Rate Estimate of Finite Length Turbo Codes

A novel method of estimating the BER performance of finite length turbo codes in a binary AWGN channel is proposed. We consider the asymptotes of BER performance at low and high Eb N0 resulted from the small and large extrinsic values, respectively. The BER performance curve transitions between two asymptotes in the waterfall region, where the transition probability is approximately obtained by...

متن کامل

Performance Analysis of Turbo Coding with AES for CCSDS Standard

Turbo codes enable reliable communication over powerconstrained communication channels at close to Shannon’s limit. Further, the performance of the communication system is enhanced by incorporating security mechanism. Security is described as the process of minimizing the vulnerabilities of assets or resources. National Institute of Standards and Technology (NIST) chose Rijndael algorithm as Ad...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013